Description: 快速傅立叶变换算法中的分裂基算法，又称基2/4算法，对一维序列，这种算法使FFT比较完善-Fast Fourier Transform algorithm separatist base algorithm, also known as base 2 / 4 algorithm, the one-dimensional sequence, so FFT algorithm sound Platform: |
Size: 2601 |
Author:刘威 |
Hits:
Description: 用于计算fft的MATLAB程序，采用时间提取的基2算法，计算N点的FFT，程序中会自动将N部位2的n次方个点-Used to calculate the fft of the MATLAB program, using the time base 2 extraction algorithm, calculation of N point FFT, the program will automatically N parts of two of the n-th power points Platform: |
Size: 225280 |
Author:Liu Jinglei |
Hits:
Description: 本文我在北航读研时主修《现代偏微分方程》时花费一个多月时间写的期末报告，里面系统阐述了快速傅里叶变换的算法原理及其在数字信号处理等工程技术中的应用。介绍了一维DFT的基2 FFT 算法频域抽取和时域抽取FFT的短发原理和编程步骤。最后在附录中给出了一维DFT的基2 FFT 算法（包括频域抽取的FFT和IFFT算法、时域抽取的FFT和IFFT算法），一维任意非基2 FFT算法，二维DFT的基2 FFT 算法以及二维DFT的任意非基2 FFT 算法的详细的Visual C++程序。-The paper systematically expounded the fast Fourier transform algorithm and its application in digital signal processing applications such as engineering technology . Introduced a one-dimensional DFT of the base 2 FFT algorithm for extraction and time domain frequency domain FFT of the short hair extraction principles and programming steps. Finally, the appendix gives the one-dimensional DFT of the base 2 FFT algorithm (including the extraction of the FFT frequency domain and IFFT algorithms, time domain FFT and IFFT algorithms extracted), one-dimensional arbitrary non-base 2 FFT algorithm, the basic two-dimensional DFT 2 FFT algorithm and two-dimensional DFT of any non-base 2 FFT algorithm in detail Visual C++ program. Platform: |
Size: 458752 |
Author:刘小 |
Hits:
Description: 用C或者matlab编写基2 FFT快速算法，输入点数是2的幂次方，序列视作既包含实部也包含虚部。要求一个函数计可以做正变换，也可以做反变换。编写输入序列，先进行正反向变换，得到离散频谱，再将离散频谱加载到输入端进行验证，从输出端获取序列，和原来的序列进行比较，看看是否相等。序列可随意设为2的幂次项！-Written by C or matlab base 2 FFT fast algorithm, the input power of 2 points is the sequence includes both the real part as the imaginary part is also included. Require a meter to do is change the function, you can also do the inverse transform. The preparation of the input sequence, first the forward and reverse transformation, discrete spectrum, discrete spectrum and then loaded into the input validation, access to sequence from the output side, and the original sequences were compared to see if equal. Sequence can be arbitrarily set to a power of 2 items! Platform: |
Size: 17408 |
Author:3Q |
Hits:
Description: 基于MSP430的FFT算法 FFT利用基-2算法实现 包括倒序和蝶形循环两部分-MSP430-based FFT algorithm FFT algorithm using base-2 and the butterfly cycle, including two reverse Platform: |
Size: 2048 |
Author:凡尘 |
Hits:
Description: 通过调用quartus ii中的宏模块，优化源代码。这样，我们就能节能自己优化代码的时间。源代码中的FFT是基—2算法。-By calling the quartus ii macro module, optimize the source code.so,we can save the time to optimize the source code by yourself.This code is base-2 of FFT algorithm,a simple algorithm to relize by VHDL. Platform: |
Size: 6522880 |
Author:陈家明 |
Hits:
Description: 计算实序列的快速傅里叶变换，它比复序列FFT算法大约可减少一半的运算量和存储量。-Calculate the real sequence of the fast Fourier transform, which is the time taken by the sequence of the base 2 FFT algorithm, it is more than complex sequence FFT algorithm can be roughly halved the amount of computation and storage. Platform: |
Size: 163840 |
Author:冰河 |
Hits:
Description: 设计一个按时间抽取的输入倒位序输出顺序的基2—fft算法程序。要求输入输出接口为可视化-Time taken by designing an inversion input sequence output sequence of the base 2-fft algorithm. Input and output interfaces requires the visualization Platform: |
Size: 1024 |
Author:qinxuan |
Hits:
Description: 采用基—2FFT算法对振动信号进行FFT计算，在绘图框绘制出频谱图，本源码已经集成了FFT操作类和绘图类，采用VS2010开发环境开发-Using the base-2FFT FFT algorithm to calculate the vibration signal in the drawing box draw the spectrum, the source has been integrated FFT operation classes and drawing classes, using VS2010 development environment to develop Platform: |
Size: 179200 |
Author:jamesdin |
Hits:
Description: DIT-FFT至简设计实现法
工程说明
案例补充说明
本案例无论是模块划分、计数器设计、还是乒乓操作的读写处理，都始终基于“至简设计”的原则，用简易的代码结构就能实现复杂的DIT-FFT蝶形运算，代码设计风格极其简洁，详细可参考附录代码。(DIT-FFT to Jane design and Implementation
Engineering description
This design is based on the discussion to simple design method to achieve the 2-FFT algorithm according to the base time selection (DIF-FFT) implementation process, support N from 8 to 1024.
Case Supplement
In this case, both the module division, the counter design, and the reading and writing of table tennis operations are always based on the "to Jane" design) Platform: |
Size: 861184 |
Author:明德扬科教
|
Hits:
Search - fft base 2 algorithm